The Plaza Launches Partnership with Magic Tree House Children’s Series New York City’s most iconic hotel, The Plaza, is embarking on an exciting new journey with Random House Children’s Books and author Mary Pope O

Source URL: www.theplazany.com

B ARCELONA G RADUATE S CHOOL OF E CONOMICS - D ATA S CIENCE Random Forest Cover Type Prediction Jéssica Leal, Tim Kreienkamp and Philipp Schmidt

Source URL: dl.dropboxusercontent.com

• Ensemble learning
• Decision trees
• Regression analysis
• Random forest
• Cross-validation
• Overfitting
• Gradient boosting
• Boosting
• Decision tree learning
• Machine learning
• Statistics
• Computational statistics

An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans†

Source URL: www.stanford.edu

• Spanning tree
• Loop-erased random walk
• Minimum spanning tree
• Chernoff bound
• Eulerian path
• NP-complete problems
• Dominating set
• Tutte polynomial
• Graph theory
• Mathematics
• Theoretical computer science

An Optimal Probabilistic Graphical Model for Point Set Matching Tib´erio S. Caetano1,2 , Terry Caelli1 , and Dante A. C. Barone2 1 2

Source URL: www.tiberiocaetano.com

• Clique
• Chordal graph
• Line graph
• Matching
• Markov random field
• Graphical model
• Graph coloring
• Clique problem
• Graph theory
• Graph operations
• Tree decomposition

Anytime Motion Planning using the RRT∗ Sertac Karaman Matthew R. Walter Alejandro Perez

Source URL: ttic.uchicago.edu

• Artificial intelligence
• Applied mathematics
• Robot control
• Rapidly-exploring random tree
• Combinatorial optimization
• Routing algorithms
• Motion planning
• A* search algorithm
• Anytime algorithm
• Search algorithms
• Theoretical computer science
• Mathematics

Reachability-Guided Sampling for Planning Under Differential Constraints Alexander Shkolnik, Matthew Walter, and Russ Tedrake Abstract— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning prob

Source URL: ttic.uchicago.edu

• Robot control
• Artificial intelligence
• Geometry
• Discrete geometry
• Motion planning
• Voronoi diagram
• Tree
• Nonholonomic system
• Bridge
• Search algorithms
• Mathematics
• Rapidly-exploring random tree

CudaTree Training Random Forests on the GPU Alex Rubinsteyn (NYU, Mount Sinai) @ GTC on March 25th, 2014

Source URL: www.rubinsteyn.com

• Random forest
• Tree
• Decision tree model
• Learning
• Applied mathematics
• Decision trees
• Ensemble learning
• Artificial intelligence

Kinodynamic Randomized Rearrangement Planning via Dynamic Transitions Between Statically Stable States Joshua A. Haustein∗ , Jennifer King† , Siddhartha S. Srinivasa† , Tamim Asfour∗ ∗ Karlsruhe Institute of Te

Source URL: www.ri.cmu.edu

• Motion planning
• Theoretical computer science
• Tmax
• Rapidly-exploring random tree
• Robot
• Kinematics
• Reactive planning
• Planner
• Library
• Robotics
• Artificial intelligence
• Automated planning and scheduling

Asymptotically-optimal Path Planning for Manipulation using Incremental Sampling-based Algorithms

Source URL: ttic.uchicago.edu

• Search algorithms
• Motion planning
• Algorithm
• Collision detection
• Computer science
• Rapidly-exploring random tree
• Theoretical computer science
• Applied mathematics
• Mathematics

Adaptive Motion Planning for Humanoid Robots Nikolaus Vahrenkamp∗ , Christian Scheurer∗ , Tamim Asfour∗ , James Kuffner† and R¨udiger Dillmann∗ ∗ Institute of Computer Science and Engineering University of K

Source URL: wwwiaim.ira.uka.de

• Physics
• Mechanical engineering
• Rapidly-exploring random tree
• Motion planning
• Probabilistic roadmap
• Humanoid robot
• Inverse kinematics
• Robot
• Degrees of freedom
• Robot kinematics
• Robot control
• Artificial intelligence